Method for dynamically adjusting the capacity of mobile communication system

ABSTRACT

The present invention presents a method for dynamically adjusting the capacity of a mobile communication system. In this method, the data rate of the data service can be properly and timely adjusted according to the current system load and the parameters of the system. Considering the integrated effect of the data rate and the service duration, the method that makes the system capacity maximum is reasonable, effective and accurate.

CROSS-REFERENCE TO RELATED APPLICATION(S)

[0001] This application is based on the Chinese Patent Application No. 03136933.2 filed on May 23, 2003, the disclosure of which is hereby incorporated by reference thereto in its entirety, and the priority of which is hereby claimed under 35 U.S.C. §119.

FIELD OF THE INVENTION

[0002] The present invention relates to the field of mobile communication, and more particularly to a method for dynamically adjusting the capacity of a mobile communication system.

BACKGROUND OF THE INVENTION

[0003] CDMA system has the characters of soft capacity, such that the cell capacity can be dynamically adjusted, that is, the load of the cell can be measured. When the cell is overloaded, the dynamic adjustment process can be initiated. Since 3G telecommunications system has the capability for dynamically controlling the channel rate, the object of dynamically adjusting a system capacity can be achieved by changing the data rate.

[0004] If the power could not be controlled very well, the power output will be fluctuated with a range of 20% to 30%. Because the transmission power of the high-speed data service is very huge, the fluctuation might be fatal. The power fluctuation does not only affect the data services, but also introduce a big interference source to other users. At present, the transmission quality, i.e., BER, is guaranteed by increasing the transmission power. Increasing the power, however, may not meet the requirement when in the edge of a cell or in deep fading environment. Furthermore, further increasing the transmission power will bring a negative consequence to the system.

[0005] In the prior art, when a system is overloaded, it is possible to decrease the system power by decreasing the service rate of the data service under the control of power. Meanwhile, lowing the interference to the system can decrease the system load. But it starts by assuming that the service duration is constant. In fact, decreasing the service rate of data service would increase the service duration simultaneity. Increasing the service duration of the data service, however, will increase the interference duration to other services, and further affects the system capacity. Because the affect of the changing data rate on the service duration is not considered, it is not decided yet whether it is good to increase the system capacity by decreasing the data rate.

[0006] We have conducted an analyses on whether decreasing of the service rate of date service can increase the capacity of the system. It is found out that decreasing the service rate will not always increase the system capacity. The existing method for adjusting date rate is on the basis of this. Therefore, the theory for adjusting the data rate is not reliable. This will result in adjusting the data rate too heavy or too small. It will greatly affect the system capacity.

[0007] Therefore, on the basis of our analysis and its conclusion, a method for dynamically adjusting the system capacity in a mobile communication system is proposed. This method has changed the common knowledge that the more the date rate is decreased, the more the system capacity is.

SUMMARY OF THE INVENTION

[0008] The purpose of the present invention is to provide a method for dynamically adjusting the capacity of a mobile communication system. Considering the integrated effect of the data rate and the service duration simultaneously, the data rate of the data service can be adjusted by this method, such that makes the system capacity maximum.

[0009] The method for dynamically adjusting the capacity of a mobile communication system of the present invention comprises the steps of:

[0010] a) the system continually detecting the load of a current cell, and comparing the current load with a load threshold defined by the system;

[0011] b) if the current load is less than the load threshold defined by the system, the service rate of the data service is not adjusted or the service rate is recovered to its original value; if the current load is more than or equal to the load threshold defined by the system, starting the dynamic adjustment on the capacity of the system to adjust the service rate of the data service, after finishing the service rate adjustment, the system returning to detect the load of a cell.

[0012] In the step b), if the current load is more than or equal to the load threshold defined by the system, the step for adjusting the service rate of the data service comprising:

[0013] A) obtaining the system interruption probability and the values of constants K′₀ and β based on the parameters of the system;

[0014] B) based on the constants β and K′₀ obtained in step A), obtaining the values of the discrete functions H₁(n), H₂(n) and G(n), and comparing them with each other;

[0015] C) if H₁(n)>H₂(n)>G(n) or H₂(n)<G(n)<H₁(n), measuring the maximum number of users, K_(e), which satisfying the maximum interruption probability allowed by the system, the expected service rate is ${R_{e} = {\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}} - ɛ}},$

[0016] where W denotes system bandwidth, ${\eta = \frac{N_{0}}{I_{0}}},$

[0017] N₀ is the power density of the background noise, I₀ is the maximum receivable power density, E_(b) is the bit energy of a certain service or a certain type of services needed to be adjusted, ε is a minor positive number; if H₂(n)<H₁(n)<G(n), the expected service rate R_(e) is the allowable minimum value R_(min) of the service, i.e. R_(e)=R_(min).

[0018] In the step A) the system interruption probability is given by: ${P_{out}^{r} = {P_{r}\left\lbrack {{\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}} \right\rbrack}},{{{where}\quad c_{i}} = {\frac{E_{b\quad i}}{I_{0}}R_{i}}},$

[0019] R_(i) is the data rate of the i^(th) type of services, E_(bi) is the bit energy of the i^(th) service type, ${M_{i} = {\sum\limits_{j = 1}^{K_{i}}\quad {SAF}_{i\quad j}}},$

[0020] SAF_(ij) denotes the active state of the i^(th) service type of the j^(th) user, M_(i) is the user number of the i^(th) service type, which is in active state in the system, h is the overhead channel interference, N is the number of the services in the cell, where N≧2, $P_{r}\left\lbrack {{\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}} \right\rbrack$

[0021] is the possibility of ${\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}$

[0022] The system interruption probability with single service is given by $\begin{matrix} {P_{out} = {{^{- \frac{\beta}{R}}{\sum\limits_{k = {\lbrack{K_{0}^{\prime}/R}\rbrack}}^{\infty}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}} = \left\{ \begin{matrix} 1 & {{K_{0}^{\prime}/R} < 1} \\ {1 - {^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}}} & {{K_{0}^{\prime}/R} \geq 1} \end{matrix} \right.}} & \quad \end{matrix}$

[0023] where β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability of the service rate R₀, K′₀=W(1−η)/(E_(b1)(1+h)), h is the overhead channel interference, E_(b1) is the bit energy of the first service; R specifically refers to the data rate of a certain service and a certain type of services that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.

[0024] In the step B), the discrete functions H₁(n) H₂ (n) and G(n) are given by $\begin{matrix} {{H_{1}(n)} = {\frac{{\beta }^{{- \beta}\quad {n/K_{0}^{\prime}}}}{K_{0}^{\prime}} \cdot \frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}} \\ {{H_{2}(n)} = {\frac{{\beta }^{{- {\beta(\quad {n + 1})}}/K_{0}^{\prime}}}{K_{0}^{\prime}} \cdot \frac{\left( {{\beta\left( \quad {n + 1} \right)}/K_{0}^{\prime}} \right)^{n}}{n!}}} \\ {{{G(n)} = {^{{- \beta}\quad {n/K_{0}^{\prime}}}\frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}},{n = 1},{2\quad \ldots}} \end{matrix}$

[0025] where β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability of the service rate R₀, K′₀=W(1−η)/(E_(b1)(1+h)), h is the overhead channel interference, E_(b1) is the bit energy of the first service, n is the discrete point in [K′₀/R]−1 for continue attenuation amplitude of function ${^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}},$

[0026] R specifically refers to the data rate of a certain service and a certain type of services that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.

[0027] In the step C), the number ε is within the range of 0 to $\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}\left( {K_{e} + 1} \right)}.$

[0028] The method by which the data rate of the data service can be properly and timely adjusted according to the current system load and some parameters of the system is reasonable, effective and accurate. The method also illustrates that the lower rate of the data service would not always generate a better result. In the case of a certain load of the system, the data rate has a best adjusting value. The value may result in a maximum system capacity. In the process of adjustment, the data rate of a certain service or a certain type of services might be adjusted, and some special data service may be prevented from the adjustment.

BRIEF DESCRIPTION ON THE DRAWINGS

[0029] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.

[0030]FIG. 1 is a flow diagram of the present invention; and

[0031]FIG. 2 is a block diagram of a preferred embodiment of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0032] The preferred embodiments of the present invention will be described in detail in accordance with the accompanying drawings.

[0033] In a cell, the message's arrival follows a Poisson distribution. The call service duration of each user follows an exponent distribution. During the infinitesimal time interval Δt, the signal arrival probability in every time interval is λΔt. Thus, the probability that the service time t is beyond a certain time T is:

Pr(t>T)=e^(−μT) ,T>0  (1)

[0034] ,where μ is the leaving probability of service, so the average call interval is 1/μ second.

[0035] By deduction, the relationship between the service rate and the service duration can be obtained, that is, the service rate R is in proportional to the leaving probability μ in formula (1): R=α·μ. Where α is given by α=R₀/μ₀, R₀, R₀ denotes the initial service rate, μ₀ denotes the leaving probability when the initial service rate is R₀.

[0036] From the above conclusion, the service rate directly affects on the leaving probability μ. The leaving probability μ is an important parameter of the interruption probability. So it is impossible to keep other conditions unchanged when changing the service rate. Thus, simply decreasing the service rate cannot enlarge the system capacity. In order to correctly determine the adjusting of the service rate, it is necessary to clearly analyze the relationship between the data rate and the capacity (or the interruption probability).

[0037] The affect of the service rate on the system capacity is described as follows. CDMA system is a strict interference limited system. In order to ensure that the service wouldn't be blocked, the following formula must be met.

I ₀ /N ₀<1/η

[0038] ,where I₀ is the maximum received power (i.e. the sum of the maximum received interference power and the useful signal, and normalized by bandwidth), N₀ is the power density of the background noise, and η is a constant, which is typically within the range of 0.1 to 0.25.

[0039] For the system, the condition for service blocking is given by $\begin{matrix} {{{\sum\limits_{i = 1}^{N}\quad {\sum\limits_{j = 1}^{K_{i}}\quad {{{SAF}_{i\quad j}\left( {1 + h} \right)}E_{bi}R_{i}}}} + {N_{0}W}} > {I_{0}W}} & (2) \end{matrix}$

[0040] ,where W is the system bandwidth, i.e., spread bandwidth, N₀ is the power density of the background noise, I₀ is the maximum received power density, N is the total number of service types in a cell; K_(i) is the user number of the i^(th) service; R_(i) is the service data rate of the i^(th) service, E_(bi) is the bit energy of the i^(th) service, where i denotes the i^(th) service type (i≦N); SAF_(ij) denotes the active state of the i^(th) service type of the j^(th) user, h is the overhead channel interference generated by the synchronization signal which is used to re-setup physical link when the data is transmitted in a discontinued manner.

[0041] Let ${\eta = \frac{N_{0}}{I_{0}}},{{\frac{E_{b\quad i}}{I_{0}}R_{i}} = c_{i}},{M_{i} = {\sum\limits_{j = 1}^{K_{i}}\quad {SAF}_{i\quad j}}}$

[0042] ,where M_(i) denotes the user number of the i^(th) service type which is in active state in a system. Assume the probability that the i^(th) service type of the j^(th) user is in active state is ρ_(i), that is P_(r)(SAF_(ij)=1)=ρ_(i), then the probability that the i^(th) service type of the j^(th) user is in non-active state is P_(r)(SAF_(ij)=0)=1−ρ=q_(i), where ρ donates the service active probability. Obviously, M_(i) follows Poisson distribution. Since the services are independent with each other, the formula $\sum\limits_{i = 1}^{N}\quad {c_{i}M_{i}}$

[0043] also follows Poisson distribution. Thus, the Erlang capability of the system can be expressed by the system interruption probability: $\begin{matrix} {P_{out}^{r} = {P_{r}\left\lbrack {{\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}} \right\rbrack}} & (3) \end{matrix}$

[0044] From the above formula (3), the single service interruption probability could be given by $\begin{matrix} {P_{out} = {{^{- \frac{\beta}{R}}{\sum\limits_{k = {\lbrack{K_{0}^{\prime}/R}\rbrack}}^{\infty}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}} = \left\{ \begin{matrix} 1 & {{K_{0}^{\prime}/R} < 1} \\ {1 - {^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}}} & {{K_{0}^{\prime}/R} \geq 1} \end{matrix} \right.}} & (4) \end{matrix}$

[0045] ,where β and K′₀ are constants, β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability of the data rate R₀; K′₀=W(1−η)/(E_(b1)(1+h)), h is the interference of the overhead channel, E_(b1) is the bit energy of the i^(st) service; R specifically refers to a certain service and a certain service data rate that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.

[0046] From the above, the system Erlang capacity could be expressed by the system interruption probability. Thus, the system interruption probability is an index of the system capability. From the system interruption probability, on the basis of the conclusion and deduction on theory, the affect of the service rate on the system capability can be obtained.

[0047] Thus, it is necessary to select a proper service rate R to maximize ${^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}},$

[0048] and then a minimum interruption probability can be obtained. Further, the maximum capacity under a given interruption probability can be obtained.

[0049] By analyzing, a discrete function could be given by: $\begin{matrix} {{H(n)} = {\frac{{\beta }^{{- \beta}\quad x_{n}^{*}}}{K_{0}^{\prime}}\frac{\left( {\beta \quad x_{n}^{*}} \right)^{n}}{n!}}} & (5) \end{matrix}$

[0050] ,where n is the discrete point in [K′₀/R]−1 for the continual attenuation amplitude of the function ${^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}},$

[0051] and where x_(n)* is a point within the continual scope $\left\lbrack {\frac{n}{K_{0}^{\prime}},\frac{n + 1}{K_{0}^{\prime}}} \right\rbrack.$

[0052] Hence, two discrete functions are defined according to the equation (5) $\begin{matrix} \begin{matrix} {{H_{1}(n)} = {\frac{\beta \quad ^{{- \beta}\quad {n/K_{0}^{\prime}}}}{K_{0}^{\prime}} \cdot \frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}} \\ {{H_{2}(n)} = {\frac{\beta \quad ^{{- \beta}\quad {{({n + 1})}/K_{0}^{\prime}}}}{K_{0}^{\prime}} \cdot \frac{\left( {\beta \quad {\left( {n + 1} \right)/K_{0}^{\prime}}} \right)^{n}}{n!}}} \end{matrix} & (6) \end{matrix}$

[0053] Further, the following formula could be proved:

H ₂(n)≦H(n)≦H ₁(n)  (7)

[0054] Obviously, both H₁(n) and H₂(n) are of degressive functions of n. Thus, H(n) is also a degressive function of n.

[0055] A discrete function is defined by: $\begin{matrix} {{{G(n)} = {^{{- \beta}\quad {n/K_{0}^{\prime}}}\frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}},{n = 1},{2\quad \ldots}} & (8) \end{matrix}$

[0056] The following conclusion can be obtained by comparing the three discrete functions H₁(n), H₂(n) and G(n)

[0057] 1) If H₁(n)≦G(n) for every n, then when n→∞ i.e. the service rate R→0, the system interruption probability will be minimum;

[0058] 2) If H₂(n)≧G(n) for every n, then when n=1 i.e. the service rate R=K′₀, the system interruption probability will be minimum, and the system capacity achieves the maximum.

[0059] By analyzing, a more practical method for adjusting service rate for data service and dynamically increasing the system capacity can be obtained. Some special data service may be prevented from the adjustment. During the adjusting procedure, it is possible to adjust the service rate of a certain data service or a certain type of data services.

[0060]FIG. 1 is a flow diagram of the present invention. As shown in FIG. 1, the method for dynamically adjusting system capacity in the mobile communication system of the present invention comprises the following steps.

[0061] First, the system continually detects the load of the current cell, and compares the current load with a load threshold defined by the system;

[0062] If the current load is less than the load threshold defined by the system, which means the system is in low load state, the service rate of data service is not adjusted or the service rate is recovered to its original value to improve transmission rate.

[0063] If the current load is more than or equal to the defined load threshold, which means the system is in heavy load, the dynamic adjustment on the system capacity is started to change the service rate of the data service.

[0064] Second, the service rate of the data service is adjusted according to the following method:

[0065] a) Obtaining the system interruption probability and the values of constants K′₀ and β according to the parameters of the system, where the parameters of the system including the system bandwidth W, the service arrival probability λ, the service active probability ρ, the service rate R, the service leaving probability μ, the interference of overhead channel h, the power density of background noise N₀, and the parameter η etc.

[0066] In theory, the system interruption probability could be given by formula. For a system with a single service, the system interruption probability could be obtained by formula (4), and for a system with two services, the system interruption probability could be obtained by: $\begin{matrix} {P_{out}^{r} = {P_{r}\left\lbrack {{{c_{1}M_{1}} + {c_{2}M_{2}}} > \frac{W\left( {1 - \eta} \right)}{1 + h}} \right\rbrack}} \\ {= {1 - {\sum\limits_{i = 1}^{\lfloor{{W{({1 - \eta})}}/{c_{1}{({1 + h})}}}\rfloor}\quad \left\lbrack \sum\limits_{j = {\lceil{{\lbrack{\frac{W{({1 - \eta})}}{1 + h} - {c_{1}i}}\rbrack}/c_{2}}\rceil}}^{\lfloor{{W{({1 - \eta})}}/{c_{2}{({1 + h})}}}\rfloor} \right.}}} \\ {\left. {\frac{\left( {\lambda_{2}{\rho_{2}/\mu_{2}}} \right)^{j}}{j!}^{- {(\frac{\lambda_{2}\rho_{2}}{\mu_{2}})}}} \right\rbrack \frac{\left( \frac{\lambda_{1}\rho_{1}}{\mu_{1}} \right)^{i}}{i!}^{- {(\frac{\lambda_{1}\rho_{1}}{\mu_{1}})}}} \end{matrix}$

[0067] In practice, the system interruption probability could be given by simulation.

[0068] The system interruption probability provides the theory foundation for the present invention. Based on the theory foundation, the present invention deduces a practical method for adjusting the service rate. In practice, it is not necessary to get the system interruption probability at every moment but only needed to know whether the system is overload.

[0069] β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability corresponding to the service rate of R₀; K′₀=W(1−η)/(E_(b1)(1+h)), h is the interference of the overhead channel, E_(b1) is the bit energy of the first service; R specifically refers to the data rate of a certain service and a certain type of services that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.

[0070] b) Based on the constants β and K′₀ obtained in step a) and in accordance with equations (6) and (8), obtaining the value of the three discrete functions H₁(n), H₂(n) and G(n), then comparing them with each other;

[0071] Obviously, formula (7) can be obtained by deduction. Formula (7) indicates that the discrete functions H₁(n), H₂(n) are degressive functions of n. Hence,

[0072] if H₂(n)<H₁(n)<G(n), according to the above conclusion 1), it is known that when service rate R→0, the system interruption probability is minimum and the system capacity is infinite. In practice, because of the limitation of the service itself, the service rate can not be decreased freely. However, through properly decreasing the service rate, the interruption probability could be decreased and the system capacity could be improved. Let the service rate R_(e) be the allowable minimum of the service rate R_(min), i.e. R_(e)=R_(min). In this situation, the maximum system capacity is maximum and the system interruption probability is minimal. The minimal system interruption probability is the limit of the adjustment. If at the moment the statistical interruption probability is still greater than the defined system interruption probability, it means the requirement of the defined system interruption probability cannot met by service rate adjustment, and the system capacity cannot be improved any more. After the service rate of the data service is adjusted, it returns to the system.

[0073] If H₁(n)>H₂(n)>G(n) or H₂(n)<H₁(n)<G(n), then it is known from the above conclusion (2) that when service rate R→K′₀, the system interruption probability is minimum. If at the moment P_(out)>P_(e), where P_(e) denotes the defined system interruption probability, it is necessary to increase the service rate to decrease the interruption probability and the system capacity; if P_(out)<P_(e), then it is necessary to decrease the service rate to increase the interruption probability and the system capacity, In practice, for maximum system capacity i.e. the maximum number of user which satisfies the requirement of the expected interruption probability, the corresponding expected service rate R_(e) should be on the utmost right of $\left\lbrack {\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e} + 1},\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}}} \right\rbrack,\quad {{i.e.\quad R_{e}} = {\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}} - ɛ}},$

[0074] where ε is a minor positive number satisfying ${0 < ɛ < \frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}\left( {K_{e} + 1} \right)}},$

[0075] the number E is within the range of 0 to $\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}\left( {K_{e} + 1} \right)},$

[0076] E_(b) specifically refers to the bit energy of a certain service or a certain type of services that will be adjusted. After adjusting the data rate, it returns to the system.

[0077] When finishing the adjustment of the service rate of the data service, it returns to detect the cell load again. If the current load is less than the threshold defined by the system, in order to improve the transmission rate, the service rate is not adjusted anymore. Or the service rate is recovered to its original value.

[0078]FIG. 2 is a block diagram of a preferred embodiment of the present invention. As shown in FIG. 2, a antenna subsystem 211 of a mobile terminal 21 receives a pilot signal of a forward link from a base station 22, and delivers it to a multiplexing module 212. The multiplexing module 212 separates the forward frequency signal and delivers it to a signal processing subsystem 213. The signal processing subsystem 213 delivers the processed signal to a power control subsystem 214. The power control subsystem 214 measures the quaclity of the received signal and generates a measurement report. The measurement report together with a feedback link signal is delivered to'the base station 22 via the multiplexing module 212 and the antenna subsystem 211.

[0079] At the base station 22, the signal is multiplexed and processed, then delivered to the base station controller 23. During the information processing, when frame processing is undergone in the base band processing module, the user's SIR can be obtained. The user's SIR is compared with the expected SIR. The mobile terminal 21 changes the transmission power according to the comparison result.

[0080] In the base station controller 23, a frame recovery module 231 outputs data to a data distribution module 232, which distributes three outputs to a power control subsystem 233, a resource management module 234 and a service subsystem 235 respectively. The load control module 2341 of the resource management module 234 detects the status of the system load continually according to the message from the base station, and compares the current system load with the upper limit of the load defined by the system. If the detected system load is greater than the defined upper limit, the service rate of a certain data service or a certain type of data services in the resource management module is adjusted in accordance with the present invention. If the detected system load is less than the defined upper limit, the service rate of a certain data service or a certain type of data services in the resource management module is adjusted in accordance with the present invention, such that the adjusted service rate remains in or recovers to the original service rate of the data service.

[0081] As many apparently widely different embodiments of the present invention can be made without departing from the spirit and scope thereof, it is to be understood that the invention is not limited to the specific embodiments thereof except as defined in the appended claims. 

What is claimed is:
 1. A method for dynamically adjusting the capacity of a mobile communication system, characterized in that the method comprising the steps of: a) the system continually detecting the load of a current cell, and comparing the current load with a load threshold defined by the system; and b) if the current load is less than the load threshold defined by the system, the service rate of the data service is not adjusted or the service rate is recovered to its original value; if the current load is more than or equal to the load threshold defined by the system, starting the dynamic adjustment on the capacity of the system to adjust the service rate of the data service, after finishing the service rate adjustment, the system returning to detect the load of a cell.
 2. The method according to claim 1, further characterized in that in the step b), if the current load is more than or equal to the load threshold defined by the system, the step for adjusting the service rate of the data service comprising: A) obtaining the system interruption probability and the values of constants K′₀ and β based on the parameters of the system; B) based on the constants β and K′₀ obtained in step A), obtaining the values of the discrete functions H₁(n), H₂(n) and G(n) and comparing them with each other; and C) if H₁(n)>H₂(n)>G(n) or H₂(n)<G (n)<H₁(n), measuring the maximum number of users, K_(e), which satisfying the maximum interruption probability allowed by the system, the expected service rate is ${R_{e} = {\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}} - ɛ}},$

where W denotes system bandwidth, ${\eta = \frac{N_{0}}{I_{0}}},$

N₀ is the power density of the background noise, I₀ is the maximum receivable power density, E_(b) is the bit energy of a certain service or a certain type of services needed to be adjusted, ε is a minor positive number; if H₂(n)<H₁(n)<G (n), the expected service rate Re is the allowable minimum value R_(min) of the service, i.e. R_(e)=R_(min).
 3. The method according to claim 2, further characterized in that in the step A) the system interruption probability is given by: ${P_{out}^{r} = {P_{r}\left\lbrack {{\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}} \right\rbrack}},{{{where}\quad c_{i}} = {\frac{E_{bi}}{I_{0}}R_{i}}},$

R_(i) is the data rate of the i^(th) type of services, E_(bi) is the bit energy of the i^(th) service type, ${M_{i} = {\sum\limits_{j = 1}^{K_{i}}\quad {SAF}_{ij}}},$

SAF_(ij) denotes the active state of the i^(th) service type of the j^(th) user, M_(i) is the user number of the i^(th) service type, which is in active state in the system, h is the overhead channel interference, N is the number of the services in the cell, where N≧2, $P_{r}\left\lbrack {{\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}} \right\rbrack$

is the possibility of ${\sum\limits_{i = 1}^{N}\quad {c_{i}{M_{i}\left( {1 + h} \right)}}} > {W\left( {1 - \eta} \right)}$


4. The method according to claim 3, further characterized in that the system interruption probability with single service is given by $P_{out} = {{^{- \frac{\beta}{R}}{\sum\limits_{k = {\lbrack{K_{0}^{\prime}/R}\rbrack}}^{\infty}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}} = \left\{ \begin{matrix} 1 & {{K_{0}^{\prime}/R} < 1} \\ {1 - {^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{K!}}}} & {{K_{0}^{\prime}/R} \geq 1} \end{matrix} \right.}$

where β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability of the service rate R₀, K′₀=W(1−η)/(E_(b1)(1+h)), h is the overhead channel interference, E_(b1) is the bit energy of the first service; R specifically refers to the data rate of a certain service and a certain type of services that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.
 5. The method according to claim 2, further characterized in that in the step B), the discrete functions H₁(n) H₂(n) and G(n) are given by $\begin{matrix} {{H_{1}(n)} = {\frac{\beta \quad ^{{- \beta}\quad {n/K_{0}^{\prime}}}}{K_{0}^{\prime}} \cdot \frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}} \\ {{H_{2}(n)} = {\frac{\beta \quad ^{{- \beta}\quad {{({n + 1})}/K_{0}^{\prime}}}}{K_{0}^{\prime}} \cdot \frac{\left( {{\beta \left( {n + 1} \right)}/K_{0}^{\prime}} \right)^{n}}{n!}}} \\ {{{G(n)} = {^{{- \beta}\quad {n/K_{0}^{\prime}}}\frac{\left( {\beta \quad {n/K_{0}^{\prime}}} \right)^{n}}{n!}}},{n = 1},{2\quad \ldots}} \end{matrix}$

where β=ρλα, λ is the service arrival probability, ρ is the service active probability; α=R₀/μ₀, R₀ is the initial service rate, μ₀ is the service leaving probability of the service rate R₀, K′₀=W(1−η)/(E_(b1)(1+h)), h is the overhead channel interference, E_(b1) is the bit energy of the first service, n is the discrete point in [K′₀/R]−1 for continue attenuation amplitude of function ${^{- \frac{\beta}{R}}{\sum\limits_{k = 0}^{{\lbrack{K_{0}^{\prime}/R}\rbrack} - 1}\quad \frac{\left( \frac{\beta}{R} \right)^{k}}{k!}}},$

R specifically refers to the data rate of a certain service and a certain type of services that will be adjusted; k=[K′₀/R] denotes the integer of K′₀/R.
 6. The method according to claim 2, further characterized in that in the step C), the number E is within the range of 0 to $\frac{{W\left( {1 - \eta} \right)}/E_{b}}{K_{e}\left( {K_{e} + 1} \right)}.$ 